منابع مشابه
Augmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کاملk-ary n-cubes versus Fat Trees
In this paper, we examine performance aspects of fat-tree topologies and compare these to k-ary ncube topologies. In particular, we apply the analytic techniques developed for cube topologies upon fat trees to understand better the characteristic of that topology. The organization of this paper is as follows: Section 1 contains an overview of k-ary n-cube and fat-tree topologies. Section 2 cont...
متن کاملON BOTTLENECK PARTITIONING k-ARY n-CUBES
/raph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a fimction of edges exposed by the partiti...
متن کاملk-ary m-way Networks: the Dual of k-ary n-cubes
This article presents k-ary m-way networks, multidimensional mesh and tori networks that are viewed as the dual of k-ary n-cube networks. An m-way channel is the physical wiring of m router and processor links. An m-way router interfaces two channels only, irrespective of the network topology or dimension. This has important advantages: the same router can be used to build networks of different...
متن کاملOn 3-extra connectivity of k-ary n-cubes
Given a graph G, a non-negative integer g and a set of vertices S, the g-extra connectivity of G is the cardinality of a minimum set S such that G − S is disconnected and each component of G− S has at least g + 1 vertices. The 2-extra connectivity of k-ary n-cubes is gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69] for k ≥ 4. This paper shows that the 3-extra connectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2011
ISSN: 0020-0255
DOI: 10.1016/j.ins.2010.09.005